Method for Reliable Shortest Path Determination in Stochastic Networks using Parametrically Defined Stable Probability Distributions
نویسندگان
چکیده
منابع مشابه
ALGORITHMS FOR BIOBJECTIVE SHORTEST PATH PROBLEMS IN FUZZY NETWORKS
We consider biobjective shortest path problems in networks with fuzzy arc lengths. Considering the available studies for single objective shortest path problems in fuzzy networks, using a distance function for comparison of fuzzy numbers, we propose three approaches for solving the biobjective prob- lems. The rst and second approaches are extensions of the labeling method to solve the sing...
متن کاملShortest Path Problem with Gamma Probability Distribution Arc Length
We propose a dynamic program to find the shortest path in a network having gamma probability distributions as arc lengths. Two operators of sum and comparison need to be adapted for the proposed dynamic program. Convolution approach is used to sum two gamma probability distributions being employed in the dynamic program.
متن کاملReliable shortest path finding in stochastic networks with spatial correlated link travel times
Reliable shortest path finding in stochastic networks with spatial correlated link travel times Bi Yu Chen a b , William H.K. Lam a , Agachai Sumalee a & Zhi-lin Li c a Department of Civil and Structural Engineering, The Hong Kong Polytechnic University, Hong Kong, PR China b State Key Laboratory of Information Engineering in Surveying, Mapping and Remote Sensing, Wuhan University, Wuhan, PR Ch...
متن کاملalgorithms for biobjective shortest path problems in fuzzy networks
we consider biobjective shortest path problems in networks with fuzzy arc lengths. considering the available studies for single objective shortest path problems in fuzzy networks, using a distance function for comparison of fuzzy numbers, we propose three approaches for solving the biobjective prob- lems. the rst and second approaches are extensions of the labeling method to solve the sing...
متن کاملStochastic Shortest Path Games
We consider dynamic, two-player, zero-sum games where the \minimizing" player seeks to drive an underlying nite-state dynamic system to a special terminal state along a least expected cost path. The \maximizer" seeks to interfere with the minimizer's progress so as to maximize the expected total cost. We consider, for the rst time, undiscounted nite-state problems, with compact action spaces, a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Труды СПИИРАН
سال: 2019
ISSN: 2078-9599,2078-9181
DOI: 10.15622/sp.2019.18.3.557-581